Go to content
- {{#headlines}}
- {{title}} {{/headlines}}
Profile
| Academic position | Lecturer, Assistant Professor, Researcher |
|---|---|
| Research fields | Theoretical Computer Science,Fundamentals of Mathematics, Logics, Set Theory |
| Keywords | Algorithmic randomness, Computable analysis, Weihrauch degrees, Computability theory, Reverse mathematics |
| Honours and awards | 2019: Honorary Research Fellow at the University of Birmingham |
Current contact address
| Country | Germany |
|---|---|
| City | Neubiberg |
| Institution | Universität der Bundeswehr München |
| Institute | Fakultät für Informatik |
| Homepage | http://hoelzl.fr |
Host during sponsorship
| Dr. Laurent Bienvenu | LIAFA, Universite Paris Cite, Paris Cedex 13 |
|---|---|
| Start of initial sponsorship | 01/01/2011 |
Programme(s)
| 2010 | Feodor Lynen Research Fellowship Programme for Postdocs |
|---|
Publications (partial selection)
| 2013 | G. Barmpalias, R. Hölzl, A. E. M. Lewis, W. Merkle Analogues of Chaitin's Omega in the computably enumerable sets. In: Information Processing Letters, 2013, 171-178 |
|---|---|
| 2013 | Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle Time-Bounded Kolmogorov Complexity and Solovay Functions. In: Theory of Computing Systems, 2013, 80-94 |
| 2012 | Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller, André Nies: The Denjoy alternative for computable functions. In: Christoph Dürr, Thomas Wilke, Proceedings of the 29th Symposium on Theoretical Aspects of Computer Science, Leibniz International Proceedings in Informatics 14. Leibniz-Zentrum für Informatik, 2012. 543-554 |